Parikh's Theorem in Commutative Kleene Algebra
نویسندگان
چکیده
Parikh’s Theorem says that the commutative image of every context free language is the commutative image of some regular set. Pilling has shown that this theorem is essentially a statement about least solutions of polynomial inequalities. We prove the following general theorem of commutative Kleene algebra, of which Parikh’s and Pilling’s theorems are special cases: Every finite system of polynomial inequalities fi x xn xi, i n, over a commutative Kleene algebraK has a unique least solution in K; moreover, the components of the solution are given by polynomials in the coefficients of the fi. We also give a closed-form solution in terms of the Jacobian matrix of the system.
منابع مشابه
Parikh's Theorem Does Not Hold for Multiplicities
We consider the question of whether the famous Parikh's theorem holds with multiplicities i.e., for formal power series instead of languages. We introduce two families of semilinear formal power series over a commutative product monoid. The strict hierarchy of algebraic, rational, recognizable and semi-linear formal power series is proved and in this way it is established that the Parikh's theo...
متن کاملA Fully Equational Proof of Parikh's Theorem
We show that the validity of Parikh’s theorem for context-free languages depends only on a few equational properties of least pre-fixed points. Moreover, we exhibit an infinite basis of μ-term equations of continuous commutative idempotent semirings. AMS Subject Classification (2000): 03C05, 16Y60, 68Q42, 68Q45, 68Q70.
متن کاملTyped Kleene Algebra with Products and Iteration Theories
We develop a typed equational system that subsumes both iteration theories and typed Kleene algebra in a common framework. Our approach is based on cartesian categories endowed with commutative strong monads to handle nondeterminism.
متن کاملExtending Parikh's Theorem to Weighted and Probabilistic Context-Free Grammars
We prove an analog of Parikh’s theorem for weighted context-free grammars over commutative, idempotent semirings, and exhibit a stochastic context-free grammar with behavior that cannot be realized by any stochastic right-linear context-free grammar. Finally, we show that every unary stochastic context-free grammar with polynomially-bounded ambiguity has an equivalent stochastic right-linear co...
متن کاملProving Parikh's theorem using Chomsky-Schutzenberger theorem
Parikh theorem was originally stated and proved by Rohkit Parikh in MIT research report in 1961. Many different proofs of this classical theorems were produced then; our goal is to give another proof using Chomsky-Schutzenberger representation theorem. We present the proof which doesn't use any formal language theory tool at all except the representation theorem, just some linear algebra.
متن کامل